<?xml version="1.0" encoding="ISO-8859-1"?>
<metadatalist>
	<metadata ReferenceType="Conference Proceedings">
		<site>sibgrapi.sid.inpe.br 802</site>
		<holdercode>{ibi 8JMKD3MGPEW34M/46T9EHH}</holdercode>
		<identifier>6qtX3pFwXQZeBBx/w4RP9</identifier>
		<repository>sid.inpe.br/banon/2002/11.05.11.03</repository>
		<lastupdate>2002:11.04.02.00.00 sid.inpe.br/banon/2001/03.30.15.38 administrator</lastupdate>
		<metadatarepository>sid.inpe.br/banon/2002/11.05.11.03.13</metadatarepository>
		<metadatalastupdate>2022:06.14.00.12.02 sid.inpe.br/banon/2001/03.30.15.38 administrator {D 2000}</metadatalastupdate>
		<doi>10.1109/SIBGRA.2000.883896</doi>
		<citationkey>OliveiraLethBortSabo:2000:HaDiSe</citationkey>
		<title>Handwritten digits segmentation based on structural approach</title>
		<year>2000</year>
		<numberoffiles>1</numberoffiles>
		<size>455 KiB</size>
		<author>Oliveira, Luiz E. Soares,</author>
		<author>Lethelier, Edouard,</author>
		<author>Bortolozzi, Flávio,</author>
		<author>Sabourin, Robert,</author>
		<editor>Carvalho, Paulo Cezar Pinto,</editor>
		<editor>Walter, Marcelo,</editor>
		<conferencename>Brazilian Symposium on Computer Graphics and Image Processing, 13 (SIBGRAPI)</conferencename>
		<conferencelocation>Gramado, RS, Brazil</conferencelocation>
		<date>17-20 Oct. 2000</date>
		<publisher>IEEE Computer Society</publisher>
		<publisheraddress>Los Alamitos</publisheraddress>
		<pages>67-73</pages>
		<booktitle>Proceedings</booktitle>
		<tertiarytype>Full Paper</tertiarytype>
		<organization>SBC - Brazilian Computer Society</organization>
		<transferableflag>1</transferableflag>
		<versiontype>finaldraft</versiontype>
		<keywords>handwritten character recognition, handwritten digit segmentation, structural approach, segmentation-based recognition system, heuristic rules, graphs.</keywords>
		<abstract>We deal with a new segmentation approach applied to unconstrained handwritten digits. The novelty of the proposed algorithm is based on the combination of two types of structural features in order to provide the best segmentation path between connected entities. This method was developed to be applied in a segmentation-based recognition system. We first present the features used to generate our basic segmentation points, and we define our segmentation paths depending on the encountered configurations with only few heuristic rules. Then, we present a strategy based on graphs in order to manage the segmentation. Finally, we evaluate the output of our segmenter using a integrated classifier with three different combination methods.</abstract>
		<targetfile>67-73.pdf</targetfile>
		<usergroup>administrator</usergroup>
		<visibility>shown</visibility>
		<nexthigherunit>8JMKD3MGPEW34M/46PN6AP</nexthigherunit>
		<nexthigherunit>8JMKD3MGPEW34M/4742MCS</nexthigherunit>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/06.10.21.49 2</citingitemlist>
		<citingitemlist>sid.inpe.br/sibgrapi/2022/04.27.03.08 2</citingitemlist>
		<hostcollection>sid.inpe.br/banon/2001/03.30.15.38</hostcollection>
		<notes>The conference was held in Gramado, RS, Brazil, from October 17 to 20.</notes>
		<lasthostcollection>sid.inpe.br/banon/2001/03.30.15.38</lasthostcollection>
		<url>http://sibgrapi.sid.inpe.br/rep-/sid.inpe.br/banon/2002/11.05.11.03</url>
	</metadata>
</metadatalist>